Characterizations of probe interval graphs
نویسندگان
چکیده
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bipartite graph from its adjacency matrix. Finally, we note that if we add a loop at every probe vertex of a probe interval graph, then the Ferrers dimension of the corresponding symmetric bipartite graph is at most 3.
منابع مشابه
Probe interval graphs and probe unit interval graphs on superclasses of cographs
A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain a (unit) interval graph by adding edges with both endpoints in the set of nonprobe vertices. Probe (unit) interval graphs form a superclass of (unit) interval graphs. Probe int...
متن کاملTwo characterizations of chain partitioned probe graphs
Chain graphs are exactly bipartite graphs without induced 2K 2 (a graph with four vertices and two disjoint edges). A graph G = (V, E) with a given independent set S ⊆ V (a set of pairwise non-adjacent vertices) is said to be a chain partitioned probe graph if G can be extended to a chain graph by adding edges between certain vertices in S. In this note we give two characterizations for chain p...
متن کاملElimination Ordering Characterizations of Digraphs with Interval and Chordal Competition Graphs
Competition graphs have appeared in a variety of applications from food webs to communication networks to energy models. The competition graph, C (D), of a digraph D has the same vertex set as D and (x; y) is an edge in C (D) if and only if there is a vertex z such that (x; z) and (y; z) are arcs in D. It has been observed that most actual food webs have interval competition graphs. Subsequent ...
متن کاملRecognition and Characterization of Chronological Interval Digraphs
Interval graphs admit elegant ordering and structural characterizations as well as linear time recognition algorithms. On the other hand, the usual interval digraphs lack all three of these characteristics. In this paper we identify another natural digraph analogue of interval graphs that we call “chronological interval digraphs”. By contrast, the new class admits an ordering characterization, ...
متن کاملGood characterizations and linear time recognition for 2-probe block graphs
Block graphs are graphs in which every block (biconnected component) is a clique. A graph G = (V,E) is said to be an (unpartitioned) k-probe block graph if there exist k independent sets Ni ⊆ V , 1 ≤ i ≤ k, such that the graph G obtained from G by adding certain edges between vertices inside the sets Ni, 1 ≤ i ≤ k, is a block graph; if the independent sets Ni are given, G is called a partitione...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0811.2675 شماره
صفحات -
تاریخ انتشار 2008